<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">

<!-- 
	Copyright (C) 2007, 2008, 2009, 2010, 2011. PARP Research Group.
	<http://perception.inf.um.es>
	University of Murcia, Spain.

	This file is part of the QVision library.

	QVision is free software: you can redistribute it and/or modify
	it under the terms of the GNU Lesser General Public License as
	published by the Free Software Foundation, version 3 of the License.

	QVision is distributed in the hope that it will be useful,
	but WITHOUT ANY WARRANTY; without even the implied warranty of
	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
	GNU Lesser General Public License for more details.

	You should have received a copy of the GNU Lesser General Public
	License along with QVision. If not, see <http://www.gnu.org/licenses/>.
-->

<html><head><meta http-equiv="content-Type" content="text/html;charset=UTF-8">
<title>QVision: Qt&#39;s Image, Video and Computer Vision Library</title>
<meta name="title" content="QVision" />
<meta name="dc.title" content="QVision" />
<meta name="url" content="http://perception.inf.um.es/QVision" />
<meta name="author" content="PARP Research Group - http://perception.inf.um.es" />
<meta name="revisit-after" content="30 DAYS"/>
<meta name="robots" content="index,follow"/>
<meta name="classification" content="*">
<meta name="rating" content="Safe For Kids">
<meta name="distribution" content="GLOBAL"/>
<meta name="description" content="Qt's Image, Video and Computer Vision Library"/>
<meta name="page-topic" content="Computer Vision research and prototype programming"/>
<meta name="geo.country" content="ES" />

<!--
Keywords:
By license:		open source, gnu, lgpl, gpl, free
By theme:		computer vision, image processing, robotics, programming, source, development
By usage:		library, toolkit, framework, prototype, application
By programming specs:	object oriented, c++, block programming, reusability, gui, graphical, parallel computing, high performance, GPU, prototyping
Interoperability with:	Qt, GSL, GNU Scientific library, OpenCV, CGAL, QWT, CUDA, mplayer, IPP, Intel Image Performance Primitives, blas, lapack
Functionallity:		image features, matrix algebra, projective geometry, mser, function minimization, function optimization, canny operator, harris operator, corner detection, performance evaluation, cpu usage, graphical interface
Main data-types:	matrix, vector, tensor, quaternion, image, polyline
Video sources:		webcam, camera, stream
Devices:		embedded, desktop computer, laptop, mini-laptop
Authors:		PARP research group. University of Murcia, Spain.
-->

<meta name="keywords" content="augmented reality, sfm, structure from motion, open source, gnu, lgpl, gpl, free, computer vision, image processing, robotics, programming, source, development, library, toolkit, framework, prototype, application, object oriented, c++, block programming, reusability, gui, graphical, parallel computing, high performance, GPU, prototyping, Qt, GSL, GNU Scientific library, OpenCV, CGAL, QWT, CUDA, mplayer, IPP, Intel Image Performance Primitives, blas, lapack, image features, matrix algebra, projective geometry, mser, function minimization, function optimization, canny operator, harris operator, corner detection, performance evaluation, cpu usage, graphical interface, matrix, vector, tensor, quaternion, image, polyline, webcam, camera, stream, embedded, desktop computer, laptop, mini-laptop, University of Murcia, Spain, PARP research group, vision por computador"/>
<meta http-equiv="keywords" content="augmented reality, sfm, structure from motion, open source, gnu, lgpl, gpl, free, computer vision, image processing, robotics, programming, source, development, library, toolkit, framework, prototype, application, object oriented, c++, block programming, reusability, gui, graphical, parallel computing, high performance, GPU, prototyping, Qt, GSL, GNU Scientific library, OpenCV, CGAL, QWT, CUDA, mplayer, IPP, Intel Image Performance Primitives, blas, lapack, image features, matrix algebra, projective geometry, mser, function minimization, function optimization, canny operator, harris operator, corner detection, performance evaluation, cpu usage, graphical interface, matrix, vector, tensor, quaternion, image, polyline, webcam, camera, stream, embedded, desktop computer, laptop, mini-laptop, University of Murcia, Spain, PARP research group, vision por computador"/>
<meta http-equiv="pragma" content="no-cache"/>
<meta http-equiv="title" content="QVision"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="tabs.css" rel="stylesheet" type="text/css" />
<link rel="shortcut icon" href="favicon.ico" />
</head><body>

<table width="100%"><tr>
	<td><a href="http://perception.inf.um.es/"><img src="parp.png" border="0" /> <big>PARP Research Group</big></a></td>
	<td align="right"><a href="http://www.um.es/"><big>Universidad de Murcia</big> <img src="um.png" border="0" /></a></td>
</tr></table>

<hr /><br />

<table width="95%" align="center"><tr><td>

<!-- Generated by Doxygen 1.6.3 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'Search');
--></script>
<div class="navigation" id="top">
  <div class="tabs">
    <ul>
      <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
      <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
      <li><a href="modules.html"><span>Modules</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
          <form id="FSearchBox" action="search.php" method="get">
            <img id="MSearchSelect" src="search/search.png" alt=""/>
            <input type="text" id="MSearchField" name="query" value="Search" size="20" accesskey="S" 
                   onfocus="searchBox.OnSearchFieldFocus(true)" 
                   onblur="searchBox.OnSearchFieldFocus(false)"/>
          </form>
        </div>
      </li>
    </ul>
  </div>
  <div class="tabs">
    <ul>
      <li><a href="files.html"><span>File&nbsp;List</span></a></li>
      <li><a href="globals.html"><span>File&nbsp;Members</span></a></li>
    </ul>
  </div>
<h1>src/qvmath/qvsparseblockmatrix.cpp</h1><a href="qvsparseblockmatrix_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> *      Copyright (C) 2010, 2011, 2012. PARP Research Group.</span>
<a name="l00003"></a>00003 <span class="comment"> *      &lt;http://perception.inf.um.es&gt;</span>
<a name="l00004"></a>00004 <span class="comment"> *      University of Murcia, Spain.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> *      This file is part of the QVision library.</span>
<a name="l00007"></a>00007 <span class="comment"> *</span>
<a name="l00008"></a>00008 <span class="comment"> *      QVision is free software: you can redistribute it and/or modify</span>
<a name="l00009"></a>00009 <span class="comment"> *      it under the terms of the GNU Lesser General Public License as</span>
<a name="l00010"></a>00010 <span class="comment"> *      published by the Free Software Foundation, version 3 of the License.</span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> *      QVision is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"> *      but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"> *      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<a name="l00015"></a>00015 <span class="comment"> *      GNU Lesser General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"> *</span>
<a name="l00017"></a>00017 <span class="comment"> *      You should have received a copy of the GNU Lesser General Public</span>
<a name="l00018"></a>00018 <span class="comment"> *      License along with QVision. If not, see &lt;http://www.gnu.org/licenses/&gt;.</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020 
<a name="l00024"></a>00024 
<a name="l00025"></a>00025 <span class="preprocessor">#include &lt;QVSparseBlockMatrix&gt;</span>
<a name="l00026"></a>00026 
<a name="l00027"></a>00027 <span class="preprocessor">#ifdef MKL_AVAILABLE</span>
<a name="l00028"></a>00028 <span class="preprocessor"></span><span class="preprocessor">  #include &quot;mkl_dss.h&quot;</span>
<a name="l00029"></a>00029 <span class="preprocessor">#endif</span>
<a name="l00030"></a>00030 <span class="preprocessor"></span>
<a name="l00031"></a>00031 <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> QVSparseBlockMatrix::transpose()<span class="keyword"> const</span>
<a name="l00032"></a>00032 <span class="keyword">    </span>{
<a name="l00033"></a>00033     <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> result(majorCols, majorRows, minorCols, minorRows);
<a name="l00034"></a>00034 
<a name="l00035"></a>00035     <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; majorRows; i++)
<a name="l00036"></a>00036         <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j &lt; majorCols; j++)
<a name="l00037"></a>00037             <span class="keywordflow">if</span> (<span class="keyword">operator</span>[](i)[j] != <a class="code" href="classQVMatrix.html" title="Implementation of numerical matrices.">QVMatrix</a>())
<a name="l00038"></a>00038                 result[j][i] = operator[](i)[j].transpose();
<a name="l00039"></a>00039 
<a name="l00040"></a>00040     <span class="keywordflow">return</span> result;
<a name="l00041"></a>00041     }
<a name="l00042"></a>00042 
<a name="l00043"></a><a class="code" href="classQVSparseBlockMatrix.html#a36a11e4a75005686b522407e67136b0c">00043</a> <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> <a class="code" href="classQVSparseBlockMatrix.html#a36a11e4a75005686b522407e67136b0c" title="Dot product for sparse block matrices.">QVSparseBlockMatrix::dotProduct</a>(<span class="keyword">const</span> <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> &amp;other,
<a name="l00044"></a>00044                     <span class="keyword">const</span> <span class="keywordtype">bool</span> transposeFirstOperand,
<a name="l00045"></a>00045                     <span class="keyword">const</span> <span class="keywordtype">bool</span> transposeSecondOperand)<span class="keyword"> const</span>
<a name="l00046"></a>00046 <span class="keyword">    </span>{
<a name="l00047"></a>00047         <span class="comment">/*if (majorCols != other.majorRows)</span>
<a name="l00048"></a>00048 <span class="comment">        {</span>
<a name="l00049"></a>00049 <span class="comment">        std::cout &lt;&lt; &quot;ERROR: tried to multiply sparse block matrices with incompatible number of blocks.&quot; &lt;&lt; std::endl</span>
<a name="l00050"></a>00050 <span class="comment">                        &lt;&lt; &quot;\tMatrix 1 number of blocks:\t&quot; &lt;&lt; majorRows &lt;&lt; &quot;x&quot; &lt;&lt; majorCols &lt;&lt; std::endl</span>
<a name="l00051"></a>00051 <span class="comment">                        &lt;&lt; &quot;\tMatrix 2 number of blocks:\t&quot; &lt;&lt; other.majorRows &lt;&lt; &quot;x&quot; &lt;&lt; other.majorCols &lt;&lt; std::endl;</span>
<a name="l00052"></a>00052 <span class="comment">        exit(1);</span>
<a name="l00053"></a>00053 <span class="comment">        }</span>
<a name="l00054"></a>00054 <span class="comment"></span>
<a name="l00055"></a>00055 <span class="comment">    if (minorCols != other.minorRows)</span>
<a name="l00056"></a>00056 <span class="comment">        {</span>
<a name="l00057"></a>00057 <span class="comment">        std::cout &lt;&lt; &quot;ERROR: tried to multiply sparse block matrices with incompatible block sizes.&quot; &lt;&lt; std::endl</span>
<a name="l00058"></a>00058 <span class="comment">            &lt;&lt; &quot;\tMatrix 1 blocks sizes:\t&quot; &lt;&lt; minorRows &lt;&lt; &quot;x&quot; &lt;&lt; minorCols &lt;&lt; std::endl</span>
<a name="l00059"></a>00059 <span class="comment">            &lt;&lt; &quot;\tMatrix 2 blocks sizes:\t&quot; &lt;&lt; other.minorRows &lt;&lt; &quot;x&quot; &lt;&lt; other.minorCols &lt;&lt; std::endl;</span>
<a name="l00060"></a>00060 <span class="comment">        exit(1);</span>
<a name="l00061"></a>00061 <span class="comment">        }*/</span>
<a name="l00062"></a>00062 
<a name="l00063"></a>00063     <span class="keywordflow">if</span> (transposeSecondOperand)
<a name="l00064"></a>00064         std::cout &lt;&lt; <span class="stringliteral">&quot;Warning: dotProduct method can&#39;t perform the multiplication transposing the second term matrix yet. &quot;</span> &lt;&lt; std::endl;
<a name="l00065"></a>00065 
<a name="l00066"></a>00066         <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> result(     transposeFirstOperand? majorCols : majorRows,
<a name="l00067"></a>00067                             other.majorCols,
<a name="l00068"></a>00068                             transposeFirstOperand? minorCols: minorRows,
<a name="l00069"></a>00069                             other.minorCols);
<a name="l00070"></a>00070 
<a name="l00071"></a>00071     <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> index1r, keys())
<a name="l00072"></a>00072         {
<a name="l00073"></a>00073         <span class="keyword">const</span> QMap&lt;int, QVMatrix&gt; &amp; majorRowFirstOperand = operator[](index1r);
<a name="l00074"></a>00074 
<a name="l00075"></a>00075         <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> index1c, majorRowFirstOperand.keys())
<a name="l00076"></a>00076                 {
<a name="l00077"></a>00077                 <span class="keyword">const</span> <a class="code" href="classQVMatrix.html" title="Implementation of numerical matrices.">QVMatrix</a> &amp; actual = majorRowFirstOperand[index1c];
<a name="l00078"></a>00078 
<a name="l00079"></a>00079                 <span class="keyword">const</span> <span class="keywordtype">int</span>       i_ = transposeFirstOperand? index1c : index1r,
<a name="l00080"></a>00080                         k_ =transposeFirstOperand? index1r : index1c;
<a name="l00081"></a>00081 
<a name="l00082"></a>00082                 <span class="keyword">const</span> QMap&lt;int, QVMatrix&gt; &amp; majorRowSecondOperand = other[k_];
<a name="l00083"></a>00083                 QMap&lt;int, QVMatrix&gt; &amp; majorRowResult = result[i_];
<a name="l00084"></a>00084 
<a name="l00085"></a>00085                 <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> j, majorRowSecondOperand.keys())
<a name="l00086"></a>00086                     {
<a name="l00087"></a>00087                     <a class="code" href="classQVMatrix.html" title="Implementation of numerical matrices.">QVMatrix</a> &amp;res = majorRowResult[j];
<a name="l00088"></a>00088 
<a name="l00089"></a>00089                     <span class="keywordflow">if</span> (res == <a class="code" href="classQVMatrix.html" title="Implementation of numerical matrices.">QVMatrix</a>())
<a name="l00090"></a>00090                         res = actual.<a class="code" href="classQVMatrix.html#a5470e61c2827d5485596c3901690154c" title="Matrix-matrix product.">dotProduct</a>(majorRowSecondOperand[j], transposeFirstOperand, <span class="keyword">false</span>);
<a name="l00091"></a>00091                     <span class="keywordflow">else</span>
<a name="l00093"></a>00093                         res += actual.<a class="code" href="classQVMatrix.html#a5470e61c2827d5485596c3901690154c" title="Matrix-matrix product.">dotProduct</a>(majorRowSecondOperand[j], transposeFirstOperand, <span class="keyword">false</span>);
<a name="l00094"></a>00094                     }
<a name="l00095"></a>00095                 }
<a name="l00096"></a>00096         }
<a name="l00097"></a>00097     <span class="keywordflow">return</span> result;
<a name="l00098"></a>00098     }
<a name="l00099"></a>00099 
<a name="l00100"></a><a class="code" href="classQVSparseBlockMatrix.html#adb286c7dbcf46f0d134bff43bab37e0c">00100</a> <a class="code" href="classQVVector.html" title="Implementation of numerical vectors.">QVVector</a> <a class="code" href="classQVSparseBlockMatrix.html#a36a11e4a75005686b522407e67136b0c" title="Dot product for sparse block matrices.">QVSparseBlockMatrix::dotProduct</a>(<span class="keyword">const</span> <a class="code" href="classQVVector.html" title="Implementation of numerical vectors.">QVVector</a> &amp;vector, <span class="keyword">const</span> <span class="keywordtype">bool</span> transposeMatrix)<span class="keyword"> const</span>
<a name="l00101"></a>00101 <span class="keyword">    </span>{
<a name="l00102"></a>00102     <span class="keyword">const</span> <span class="keywordtype">int</span>   majorSourceIndex = transposeMatrix? majorRows: majorCols,
<a name="l00103"></a>00103             minorSourceIndex = transposeMatrix? minorRows: minorCols;
<a name="l00104"></a>00104 
<a name="l00105"></a>00105     <span class="keyword">const</span> <span class="keywordtype">int</span>   majorDestinationIndex = transposeMatrix? majorCols: majorRows,
<a name="l00106"></a>00106             minorDestinationIndex = transposeMatrix? minorCols: minorRows;
<a name="l00107"></a>00107 
<a name="l00108"></a>00108     <span class="comment">// Get sparse block vector</span>
<a name="l00109"></a>00109     QVector&lt; QVVector &gt; sparseBlockVector(majorSourceIndex);
<a name="l00110"></a>00110     <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; majorSourceIndex; i++)
<a name="l00111"></a>00111         sparseBlockVector[i] = vector.mid(i*minorSourceIndex, minorSourceIndex);
<a name="l00112"></a>00112 
<a name="l00113"></a>00113     <span class="comment">// Multiply sparse block vector by sparse block matrix</span>
<a name="l00114"></a>00114     QVector&lt; QVVector &gt; sparseBlockResult(majorDestinationIndex, <a class="code" href="classQVVector.html" title="Implementation of numerical vectors.">QVVector</a>(minorDestinationIndex, 0.0));
<a name="l00115"></a>00115     <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> i, keys())
<a name="l00116"></a>00116         {
<a name="l00117"></a>00117         <span class="keyword">const</span> QMap&lt;int, QVMatrix&gt; &amp; majorRow = operator[](i);
<a name="l00118"></a>00118         <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> j, majorRow.keys())
<a name="l00119"></a>00119             <span class="keywordflow">if</span> (not transposeMatrix)
<a name="l00121"></a>00121                 sparseBlockResult[i] += majorRow[j].dotProduct(sparseBlockVector[j], transposeMatrix);
<a name="l00122"></a>00122             <span class="keywordflow">else</span>
<a name="l00123"></a>00123                 sparseBlockResult[j] += majorRow[j].dotProduct(sparseBlockVector[i], transposeMatrix);
<a name="l00124"></a>00124         }
<a name="l00125"></a>00125 
<a name="l00126"></a>00126     <span class="comment">// Get dense vector from sparse block vector</span>
<a name="l00127"></a>00127     <a class="code" href="classQVVector.html" title="Implementation of numerical vectors.">QVVector</a> result(majorDestinationIndex*minorDestinationIndex);
<a name="l00128"></a>00128     <span class="keywordtype">double</span> *resultPtr = result.data();
<a name="l00129"></a>00129 
<a name="l00130"></a>00130     <span class="keywordtype">int</span> i = 0;
<a name="l00131"></a>00131     <span class="keywordflow">foreach</span>(<a class="code" href="classQVVector.html" title="Implementation of numerical vectors.">QVVector</a> v, sparseBlockResult)
<a name="l00132"></a>00132         {
<a name="l00133"></a>00133         <span class="keyword">const</span> <span class="keywordtype">double</span> *vPtr = v.constData();
<a name="l00134"></a>00134         <span class="keywordtype">double</span> *blockVectorPtr = resultPtr + minorDestinationIndex*i;
<a name="l00135"></a>00135 
<a name="l00136"></a>00136         <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j &lt; minorDestinationIndex; j++)
<a name="l00137"></a>00137             blockVectorPtr[j] = vPtr[j];
<a name="l00138"></a>00138         i++;
<a name="l00139"></a>00139         }
<a name="l00140"></a>00140 
<a name="l00141"></a>00141     <span class="keywordflow">return</span> result;
<a name="l00142"></a>00142     }
<a name="l00143"></a>00143 
<a name="l00144"></a><a class="code" href="classQVSparseBlockMatrix.html#a603b844cfe6c0102ee10cd3dee2563c2">00144</a> <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> &amp; <a class="code" href="classQVSparseBlockMatrix.html#a603b844cfe6c0102ee10cd3dee2563c2" title="Copy operator.">QVSparseBlockMatrix::operator=</a>(<span class="keyword">const</span> <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> &amp;other)
<a name="l00145"></a>00145     {
<a name="l00146"></a>00146     majorRows = other.majorRows;
<a name="l00147"></a>00147     majorCols = other.majorCols;
<a name="l00148"></a>00148     minorRows = other.minorRows;
<a name="l00149"></a>00149     minorCols = other.minorCols;
<a name="l00150"></a>00150 
<a name="l00151"></a>00151     <span class="comment">//*(QMap&lt;int, QMap&lt;int, QVMatrix&gt; &gt; *)this = QMap&lt;int, QMap&lt;int, QVMatrix&gt; &gt;();</span>
<a name="l00152"></a>00152     <span class="comment">//foreach(int ib, other.keys())</span>
<a name="l00153"></a>00153     <span class="comment">//  {</span>
<a name="l00154"></a>00154     <span class="comment">//  const QMap&lt;int, QVMatrix&gt; &amp;majorRow = other[ib];</span>
<a name="l00155"></a>00155     <span class="comment">//  foreach(int jb, majorRow.keys())</span>
<a name="l00156"></a>00156     <span class="comment">//          this-&gt;setBlock(ib, jb, majorRow[jb]);</span>
<a name="l00157"></a>00157     <span class="comment">//  }</span>
<a name="l00158"></a>00158 
<a name="l00159"></a>00159     QMap&lt;int, QMap&lt;int, QVMatrix&gt; &gt;::operator=(other);
<a name="l00160"></a>00160     <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00161"></a>00161     }
<a name="l00162"></a>00162 
<a name="l00163"></a>00163 <span class="comment">// Generate random positive definite block matrix (NBxNB blocks, each NxN size), with given probability NZProb of off-diagonal</span>
<a name="l00164"></a>00164 <span class="comment">// nonzero blocks (by construction, diagonal is always nonzero):</span>
<a name="l00165"></a><a class="code" href="classQVSparseBlockMatrix.html#af2826bfd4440734cf95c6d16099f15b2">00165</a> <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> <a class="code" href="classQVSparseBlockMatrix.html#af2826bfd4440734cf95c6d16099f15b2" title="Generates a random square sparse block matrix The sparse block matrix must have compatible...">QVSparseBlockMatrix::randomSquare</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> NB,<span class="keyword">const</span> <span class="keywordtype">int</span> N, <span class="keyword">const</span> <span class="keywordtype">double</span> NZProb, <span class="keyword">const</span> <span class="keywordtype">bool</span> symmetric, <span class="keyword">const</span> <span class="keywordtype">bool</span> positive)
<a name="l00166"></a>00166 {
<a name="l00167"></a>00167     <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> result(NB,NB,N,N);
<a name="l00168"></a>00168 
<a name="l00169"></a>00169     <span class="keywordflow">if</span>(symmetric and positive) {
<a name="l00170"></a>00170         <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> inter(NB*(NB+1)/2,NB,N,N);
<a name="l00171"></a>00171 
<a name="l00172"></a>00172         <span class="keywordtype">int</span> row = 0;
<a name="l00173"></a>00173         <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;NB;i++) {
<a name="l00174"></a>00174             <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=i;j&lt;NB;j++) {
<a name="l00175"></a>00175                 <span class="keywordtype">double</span> roulette=random(0.0,1.0);
<a name="l00176"></a>00176                 <span class="keywordflow">if</span>( (i==j) or (roulette &lt;= NZProb)) {
<a name="l00177"></a>00177                     inter.<a class="code" href="classQVSparseBlockMatrix.html#a0cb729d3480d161417812d5ddbc2b378" title="Set a data block.">setBlock</a>(row,i,<a class="code" href="classQVMatrix.html#ad2840553c7fa2cf81c8ce982db34b7b4" title="Creates a matrix of random values.">QVMatrix::random</a>(N,N));
<a name="l00178"></a>00178                     inter.<a class="code" href="classQVSparseBlockMatrix.html#a0cb729d3480d161417812d5ddbc2b378" title="Set a data block.">setBlock</a>(row,j,<a class="code" href="classQVMatrix.html#ad2840553c7fa2cf81c8ce982db34b7b4" title="Creates a matrix of random values.">QVMatrix::random</a>(N,N));
<a name="l00179"></a>00179                 }
<a name="l00180"></a>00180                 row++;
<a name="l00181"></a>00181             }
<a name="l00182"></a>00182         }
<a name="l00183"></a>00183 
<a name="l00184"></a>00184         result = inter.<a class="code" href="classQVSparseBlockMatrix.html#a36a11e4a75005686b522407e67136b0c" title="Dot product for sparse block matrices.">dotProduct</a>(inter,<span class="keyword">true</span>,<span class="keyword">false</span>);
<a name="l00185"></a>00185     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (symmetric and not positive) {
<a name="l00186"></a>00186         <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;NB;i++) {
<a name="l00187"></a>00187             <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=i;j&lt;NB;j++) {
<a name="l00188"></a>00188                 <span class="keywordtype">double</span> roulette=random(0.0,1.0);
<a name="l00189"></a>00189                 <span class="keywordflow">if</span>( (i==j) or (roulette &lt;= NZProb)) {
<a name="l00190"></a>00190                     <a class="code" href="classQVMatrix.html" title="Implementation of numerical matrices.">QVMatrix</a> inter = <a class="code" href="classQVMatrix.html#ad2840553c7fa2cf81c8ce982db34b7b4" title="Creates a matrix of random values.">QVMatrix::random</a>(N,N);
<a name="l00191"></a>00191                     <span class="keywordflow">if</span>(i==j)
<a name="l00192"></a>00192                         result.<a class="code" href="classQVSparseBlockMatrix.html#a0cb729d3480d161417812d5ddbc2b378" title="Set a data block.">setBlock</a>(i,j,(inter+inter.<a class="code" href="classQVMatrix.html#a2f87710c9d8ae4b07b03605daea3782e" title="Change the order of the indexes in the matrix.">transpose</a>())/2);
<a name="l00193"></a>00193                     <span class="keywordflow">else</span> {
<a name="l00194"></a>00194                         result.<a class="code" href="classQVSparseBlockMatrix.html#a0cb729d3480d161417812d5ddbc2b378" title="Set a data block.">setBlock</a>(j,i,inter);
<a name="l00195"></a>00195                         result.<a class="code" href="classQVSparseBlockMatrix.html#a0cb729d3480d161417812d5ddbc2b378" title="Set a data block.">setBlock</a>(i,j,inter.<a class="code" href="classQVMatrix.html#a2f87710c9d8ae4b07b03605daea3782e" title="Change the order of the indexes in the matrix.">transpose</a>());
<a name="l00196"></a>00196                     }
<a name="l00197"></a>00197                 }
<a name="l00198"></a>00198             }
<a name="l00199"></a>00199         }
<a name="l00200"></a>00200     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (not symmetric and not positive) {
<a name="l00201"></a>00201         <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;NB;i++) {
<a name="l00202"></a>00202             <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;NB;j++) {
<a name="l00203"></a>00203                 <span class="keywordtype">double</span> roulette=random(0.0,1.0);
<a name="l00204"></a>00204                 <span class="keywordflow">if</span>( (i==j) or (roulette &lt;= NZProb)) {
<a name="l00205"></a>00205                     <a class="code" href="classQVMatrix.html" title="Implementation of numerical matrices.">QVMatrix</a> inter = <a class="code" href="classQVMatrix.html#ad2840553c7fa2cf81c8ce982db34b7b4" title="Creates a matrix of random values.">QVMatrix::random</a>(N,N);
<a name="l00206"></a>00206                     result.<a class="code" href="classQVSparseBlockMatrix.html#a0cb729d3480d161417812d5ddbc2b378" title="Set a data block.">setBlock</a>(i,j,inter);
<a name="l00207"></a>00207                 }
<a name="l00208"></a>00208             }
<a name="l00209"></a>00209         }
<a name="l00210"></a>00210     } <span class="keywordflow">else</span> { <span class="comment">// not symmetric and positive: error</span>
<a name="l00211"></a>00211         qFatal(<span class="stringliteral">&quot;QVSparseBlockMatrix::randomSquare(): not symmetric and positive definite matrix requested&quot;</span>);
<a name="l00212"></a>00212     }
<a name="l00213"></a>00213 
<a name="l00214"></a>00214     <span class="keywordflow">return</span> result;
<a name="l00215"></a>00215 }
<a name="l00216"></a>00216 
<a name="l00217"></a>00217 
<a name="l00218"></a>00218 <span class="comment">//--------------------------</span>
<a name="l00219"></a>00219 
<a name="l00220"></a>00220 <span class="preprocessor">#ifdef MKL_AVAILABLE</span>
<a name="l00221"></a>00221 <span class="preprocessor"></span>MKLPardisoSparseFormat::MKLPardisoSparseFormat(<span class="keyword">const</span> <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> qvspmatrix, <span class="keywordtype">bool</span> isSymmetric):
<a name="l00222"></a>00222     majorRows(qvspmatrix.getMajorRows()), majorCols(qvspmatrix.getMajorCols()),
<a name="l00223"></a>00223     minorRows(qvspmatrix.getMinorRows()), minorCols(qvspmatrix.getMinorCols())
<a name="l00224"></a>00224     {
<a name="l00225"></a>00225     <span class="comment">// Subblock rows (sbm) and columns (sbn):</span>
<a name="l00226"></a>00226     <span class="keywordtype">int</span> sbr = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#af6637b61809a2d386d8d6ea3078a96b6" title="Get minorRows from a sparse block matrix.">getMinorRows</a>();
<a name="l00227"></a>00227     <span class="keywordtype">int</span> sbc = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#ad606f1e2fe760064d0494e7c133dbed7" title="Get minorCols from a sparse block matrix.">getMinorCols</a>();
<a name="l00228"></a>00228     <span class="comment">// Block rows (br) and block columns (bc):</span>
<a name="l00229"></a>00229     <span class="keywordtype">int</span> br = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#a202dae52dc2ec0501ceddc53ffc31aac" title="Get majorRows from a sparse block matrix.">getMajorRows</a>();
<a name="l00230"></a>00230     <span class="keywordtype">int</span> bc = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#a6cb89146c9191b915b8f493f0be6becc" title="Get majorCols from a sparse block matrix.">getMajorCols</a>();
<a name="l00231"></a>00231 
<a name="l00232"></a>00232     <span class="comment">// Initialization:</span>
<a name="l00233"></a>00233     nRows = sbr*br;
<a name="l00234"></a>00234     nCols = sbc*bc;
<a name="l00235"></a>00235 
<a name="l00236"></a>00236     <span class="comment">// Compute total number of nonzero blocks (tb), as well as number of matrices in the diagonal (nmd):</span>
<a name="l00237"></a>00237     <span class="keywordtype">int</span> tb = 0, nmd = 0;
<a name="l00238"></a>00238     <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> ib, qvspmatrix.keys())
<a name="l00239"></a>00239         <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> jb, qvspmatrix[ib].keys())
<a name="l00240"></a>00240             {
<a name="l00241"></a>00241             <span class="keywordflow">if</span>(isSymmetric)
<a name="l00242"></a>00242                 {
<a name="l00243"></a>00243                 <span class="keywordflow">if</span>(ib &lt;= jb)
<a name="l00244"></a>00244                     tb++;
<a name="l00245"></a>00245                 <span class="keywordflow">if</span>(ib == jb)
<a name="l00246"></a>00246                     nmd++;
<a name="l00247"></a>00247                 }
<a name="l00248"></a>00248             <span class="keywordflow">else</span>
<a name="l00249"></a>00249                 tb++;
<a name="l00250"></a>00250             }
<a name="l00251"></a>00251 
<a name="l00252"></a>00252     <span class="comment">// Total number of nonzero elements:</span>
<a name="l00253"></a>00253     nNonZeros = tb*sbr*sbc;
<a name="l00254"></a>00254     <span class="keywordflow">if</span>(isSymmetric)
<a name="l00255"></a>00255         nNonZeros -= nmd*(sbr&gt;sbc ? sbr*sbc-sbc*(sbc+1)/2 : sbr*(sbr-1)/2);
<a name="l00256"></a>00256 
<a name="l00257"></a>00257     <span class="comment">// Create space and fill three PARDISO arrays:</span>
<a name="l00258"></a>00258     rowIndex = <span class="keyword">new</span> _INTEGER_t [nRows+1];
<a name="l00259"></a>00259     columns = (nNonZeros==0) ? NULL : <span class="keyword">new</span> _INTEGER_t [nNonZeros];
<a name="l00260"></a>00260     values = (nNonZeros==0) ? NULL : <span class="keyword">new</span> _DOUBLE_PRECISION_t [nNonZeros];
<a name="l00261"></a>00261     <span class="keywordtype">int</span> indexvalues = 0, indexrows = 0;
<a name="l00262"></a>00262     <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> ib, qvspmatrix.keys())
<a name="l00263"></a>00263         {
<a name="l00264"></a>00264         <span class="keyword">const</span> QMap&lt;int, QVMatrix&gt; &amp;majorRow = qvspmatrix[ib];
<a name="l00265"></a>00265 
<a name="l00266"></a>00266         <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;sbr;i++)
<a name="l00267"></a>00267             {
<a name="l00268"></a>00268             rowIndex[indexrows] = indexvalues + 1;
<a name="l00269"></a>00269             <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> jb, majorRow.keys())
<a name="l00270"></a>00270                 {
<a name="l00271"></a>00271                 <span class="keywordtype">int</span> increment = 0;
<a name="l00272"></a>00272                 <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;sbc;j++)
<a name="l00273"></a>00273                     {
<a name="l00274"></a>00274                     <span class="keywordflow">if</span>(isSymmetric and ( (ib &gt; jb) or ( (ib == jb) and (i &gt; j) ) ) )
<a name="l00275"></a>00275                         <span class="keywordflow">continue</span>;
<a name="l00276"></a>00276                     values[indexvalues] = majorRow[jb](i,j);
<a name="l00277"></a>00277                     columns[indexvalues] = jb*sbc + j + 1;
<a name="l00278"></a>00278                     indexvalues++;
<a name="l00279"></a>00279                     increment++;
<a name="l00280"></a>00280                     }
<a name="l00281"></a>00281 
<a name="l00282"></a>00282                 <span class="comment">//std::cout &lt;&lt; &quot;Increment = &quot; &lt;&lt; increment &lt;&lt; std::endl;</span>
<a name="l00283"></a>00283                 <span class="comment">//std::cout &lt;&lt; &quot;estimated = &quot; &lt;&lt; ( isSymmetric?sbc: (sbc/2+1) )&lt;&lt; std::endl;</span>
<a name="l00284"></a>00284                 }
<a name="l00285"></a>00285             indexrows++;
<a name="l00286"></a>00286             }
<a name="l00287"></a>00287         }
<a name="l00288"></a>00288     rowIndex[indexrows] = indexvalues + 1;
<a name="l00289"></a>00289 
<a name="l00290"></a>00290     <span class="comment">/*for(int i=0;i&lt;nRows+1;i++)</span>
<a name="l00291"></a>00291 <span class="comment">    std::cout &lt;&lt; rowIndex[i] &lt;&lt; &quot; &quot;;</span>
<a name="l00292"></a>00292 <span class="comment">    std::cout &lt;&lt; &quot;\n&quot;;</span>
<a name="l00293"></a>00293 <span class="comment">    for(int i=0;i&lt;nNonZeros;i++)</span>
<a name="l00294"></a>00294 <span class="comment">    std::cout &lt;&lt; columns[i] &lt;&lt; &quot; &quot;;</span>
<a name="l00295"></a>00295 <span class="comment">    std::cout &lt;&lt; &quot;\n&quot;;</span>
<a name="l00296"></a>00296 <span class="comment">    for(int i=0;i&lt;nNonZeros;i++)</span>
<a name="l00297"></a>00297 <span class="comment">    std::cout &lt;&lt; values[i] &lt;&lt; &quot; &quot;;</span>
<a name="l00298"></a>00298 <span class="comment">    std::cout &lt;&lt; &quot;\n&quot;;*/</span>
<a name="l00299"></a>00299 
<a name="l00300"></a>00300     }
<a name="l00301"></a>00301 
<a name="l00302"></a>00302 MKLPardisoSparseFormat::~MKLPardisoSparseFormat()
<a name="l00303"></a>00303 {
<a name="l00304"></a>00304     <span class="keywordflow">if</span>(rowIndex != NULL) <span class="keyword">delete</span> [] rowIndex;
<a name="l00305"></a>00305     <span class="keywordflow">if</span>(columns != NULL) <span class="keyword">delete</span> [] columns;
<a name="l00306"></a>00306     <span class="keywordflow">if</span>(values != NULL) <span class="keyword">delete</span> [] values;
<a name="l00307"></a>00307 }
<a name="l00308"></a>00308 
<a name="l00309"></a>00309 <span class="keywordtype">void</span> squareSymmetricSparseMatrixToPardisoFormat(<span class="keyword">const</span> <a class="code" href="classQVSparseBlockMatrix.html" title="Implementation of sparse block matrices.">QVSparseBlockMatrix</a> &amp;qvspmatrix, MKLPardisoSparseFormat &amp;pardiso)
<a name="l00310"></a>00310     {
<a name="l00311"></a>00311     <span class="comment">//std::cout &lt;&lt; &quot;[squareSymmetricSparseMatrixToPardisoFormat] xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx&quot; &lt;&lt; std::endl;</span>
<a name="l00312"></a>00312     pardiso.majorRows = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#a202dae52dc2ec0501ceddc53ffc31aac" title="Get majorRows from a sparse block matrix.">getMajorRows</a>();
<a name="l00313"></a>00313     pardiso.majorCols = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#a6cb89146c9191b915b8f493f0be6becc" title="Get majorCols from a sparse block matrix.">getMajorCols</a>();
<a name="l00314"></a>00314     pardiso.minorRows = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#af6637b61809a2d386d8d6ea3078a96b6" title="Get minorRows from a sparse block matrix.">getMinorRows</a>();
<a name="l00315"></a>00315     pardiso.minorCols = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#ad606f1e2fe760064d0494e7c133dbed7" title="Get minorCols from a sparse block matrix.">getMinorCols</a>();
<a name="l00316"></a>00316 
<a name="l00317"></a>00317     <span class="comment">// ---------------------------------------</span>
<a name="l00318"></a>00318     <span class="comment">// Subblock rows (sbm) and columns (sbn):</span>
<a name="l00319"></a>00319     <span class="keywordtype">int</span> sbr = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#af6637b61809a2d386d8d6ea3078a96b6" title="Get minorRows from a sparse block matrix.">getMinorRows</a>();
<a name="l00320"></a>00320     <span class="keywordtype">int</span> sbc = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#ad606f1e2fe760064d0494e7c133dbed7" title="Get minorCols from a sparse block matrix.">getMinorCols</a>();
<a name="l00321"></a>00321 
<a name="l00322"></a>00322     <span class="comment">// Block rows (br) and block columns (bc):</span>
<a name="l00323"></a>00323     <span class="keywordtype">int</span> br = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#a202dae52dc2ec0501ceddc53ffc31aac" title="Get majorRows from a sparse block matrix.">getMajorRows</a>();
<a name="l00324"></a>00324     <span class="keywordtype">int</span> bc = qvspmatrix.<a class="code" href="classQVSparseBlockMatrix.html#a6cb89146c9191b915b8f493f0be6becc" title="Get majorCols from a sparse block matrix.">getMajorCols</a>();
<a name="l00325"></a>00325 
<a name="l00326"></a>00326     <span class="keywordflow">if</span> (br != bc)
<a name="l00327"></a>00327         {
<a name="l00328"></a>00328         std::cout &lt;&lt; <span class="stringliteral">&quot;ERROR 01&quot;</span> &lt;&lt; std::endl;
<a name="l00329"></a>00329         exit(0);
<a name="l00330"></a>00330         }
<a name="l00331"></a>00331 
<a name="l00332"></a>00332     <span class="keywordflow">if</span> (sbr != sbc)
<a name="l00333"></a>00333         {
<a name="l00334"></a>00334         std::cout &lt;&lt; <span class="stringliteral">&quot;ERROR 02&quot;</span> &lt;&lt; std::endl;
<a name="l00335"></a>00335         exit(0);
<a name="l00336"></a>00336         }
<a name="l00337"></a>00337 
<a name="l00338"></a>00338     <span class="comment">// Initialization:</span>
<a name="l00339"></a>00339     pardiso.nRows = sbr*br;
<a name="l00340"></a>00340     pardiso.nCols = sbc*bc;
<a name="l00341"></a>00341 
<a name="l00342"></a>00342     <span class="comment">// Compute total number of nonzero blocks (tb), as well as number of matrices in the diagonal (nmd):</span>
<a name="l00343"></a>00343 
<a name="l00344"></a>00344     <span class="comment">// Total number of nonzero elements:</span>
<a name="l00345"></a>00345     pardiso.nNonZeros = qvspmatrix.blockCount * sbc * sbr - bc * sbr*(sbr-1)/2;
<a name="l00346"></a>00346     pardiso.rowIndex = <span class="keyword">new</span> <span class="keywordtype">int</span> [pardiso.nRows+2];
<a name="l00347"></a>00347     pardiso.columns = <span class="keyword">new</span> <span class="keywordtype">int</span> [pardiso.nNonZeros];
<a name="l00348"></a>00348     pardiso.values = <span class="keyword">new</span> <span class="keywordtype">double</span> [pardiso.nNonZeros];
<a name="l00349"></a>00349     <span class="comment">//std::cout &lt;&lt; &quot;Non-zeros = &quot; &lt;&lt; pardiso.nNonZeros &lt;&lt; std::endl;</span>
<a name="l00350"></a>00350 
<a name="l00351"></a>00351     <span class="keywordtype">int</span> tempIndex = 0, tempCount = 1;
<a name="l00352"></a>00352     <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> ib, qvspmatrix.keys())
<a name="l00353"></a>00353         {
<a name="l00354"></a>00354         <span class="keyword">const</span> QMap&lt;int, QVMatrix&gt; &amp;majorRow = qvspmatrix[ib];
<a name="l00355"></a>00355 
<a name="l00356"></a>00356         <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; sbr; tempCount += sbc*majorRow.count() - i, i++)
<a name="l00357"></a>00357             pardiso.rowIndex[tempIndex++] = tempCount;
<a name="l00358"></a>00358         pardiso.rowIndex[tempIndex] = tempCount;
<a name="l00359"></a>00359 
<a name="l00360"></a>00360         <span class="keywordtype">int</span> rowBlockCount = 0;
<a name="l00361"></a>00361         <span class="keywordflow">foreach</span>(<span class="keywordtype">int</span> jb, majorRow.keys())
<a name="l00362"></a>00362             {
<a name="l00363"></a>00363             <span class="keyword">const</span> <span class="keywordtype">double</span> *matrixData = majorRow[jb].getReadData();
<a name="l00364"></a>00364             <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;sbr;i++)
<a name="l00365"></a>00365                 {
<a name="l00366"></a>00366                 <span class="keywordflow">if</span> (ib &gt; jb)
<a name="l00367"></a>00367                     {
<a name="l00368"></a>00368                     std::cout &lt;&lt; <span class="stringliteral">&quot;------------------ ***** &amp;&amp;&amp; Error 989577546435634 *********** -----------------&quot;</span> &lt;&lt; std::endl;
<a name="l00369"></a>00369                     <span class="keywordflow">continue</span>;
<a name="l00370"></a>00370                     }
<a name="l00371"></a>00371 
<a name="l00372"></a>00372                 <span class="keyword">const</span> <span class="keywordtype">double</span> *rowData = matrixData + sbc*i;
<a name="l00373"></a>00373                 <span class="keywordtype">int</span> indexvalues = pardiso.rowIndex[ib * sbr + i]-1 + rowBlockCount * sbc - ((ib != jb)?i:0);
<a name="l00374"></a>00374 
<a name="l00375"></a>00375                 <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;sbc;j++)
<a name="l00376"></a>00376                     {
<a name="l00377"></a>00377                     <span class="keywordflow">if</span>( (ib == jb) and (i &gt; j) )
<a name="l00378"></a>00378                         <span class="keywordflow">continue</span>;
<a name="l00379"></a>00379 
<a name="l00380"></a>00380                     pardiso.values[indexvalues] = rowData[j];
<a name="l00381"></a>00381                     pardiso.columns[indexvalues] = jb*sbc + j + 1;
<a name="l00382"></a>00382                     indexvalues++;
<a name="l00383"></a>00383                     }
<a name="l00384"></a>00384                 }
<a name="l00385"></a>00385             rowBlockCount++;
<a name="l00386"></a>00386             }
<a name="l00387"></a>00387         }
<a name="l00388"></a>00388     }
<a name="l00389"></a>00389 <span class="preprocessor">#endif</span>
</pre></div></div>
</td></tr></table>

<br /><hr><br />
<center><a href="http://perception.inf.um.es/QVision">QVision framework</a>.
<a href="http://perception.inf.um.es">PARP research group</a>.
Copyright &copy; 2007, 2008, 2009, 2010, 2011.</center>
<br />
</body>
</html>
